Integrating Low Level Symmetries into Reachability Analysis
نویسنده
چکیده
We present three methods for the integration of symmetries into reachability analysis Two of them lead to perfect reduction but their runtime depends on the symmetry structure The third one works always fast but does not always yield perfect reduction
منابع مشابه
Integrating Low Level Symmetries into Reachability Analysis
We present three methods for the integration of symmetries into reachability analysis. Two of them lead to perfect reduction but their runtime depends on the symmetry structure. The third one works always fast but does not always yield perfect reduction.
متن کاملAutomatic Symmetry Detection in Well-Formed Nets
Formal verification of complex systems using high-level Petri Nets faces the so-called state-space explosion problem. In the context of Petri nets generated from a higher level specification, this problem is particularly acute due to the inherent size of the considered models. A solution is to perform a symbolic analysis of the reachability graph, which exploits the symmetry of a model. Well-Fo...
متن کاملSymbolic Reachability Graph and Partial Symmetries
The construction of symbolic reachability graphs is a useful technique for reducingg state explosion in High-level Petri nets. Such a reduction is obtained by exploitingg the symmetries of the whole net [1]. In t his paper, we extendd this methodd to deal with partial symmetries. In a first tim e, we introduce an example which shows the interest andd the principles of o ur method. Then we devel...
متن کاملSymmetries of Petri Nets
A definition of Petri net symmetries is given and an algorithm is introduced, which computes these symmetries. Then three examples are given how algorithms from different fields of Petri net analysis can be improved using symmetries, namely computation of reachability graphs, semipositive place invariants and structural deadlocks, respectively.
متن کاملFinite Symbolic Reachability Graphs for High-Level Petri Nets
The construction of reachability graphs (rg) is one of the most useful techniques to analyse the properties of concurrent systems modelled by Petri nets. Such a graph describes all the possible behaviours of the system, and its construction is straightforward. When high-level Petri nets are under consideration, the size of the graph most often is infinite or large. The reason for this combinato...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000